SOME BOUNDS ON APPROXIMATION ALGORITHMS FOR n/m/I/LMAYe AND n/2/F/LMAx SCHEDULING PROBLEMS
نویسندگان
چکیده
In this paper, we analyze approximation algorithms for two types of scheduling problems. The first is the n jobs scheduling problem with due dates on m identical machines to minimize the maximum lateness. For this problem n/m/I/Lmax, we propose two approximation algorithms and derive their worst case bounds. The second is the 2 x n flow shop scheduling problem with due dates to minimize the maximum lateness. For this problem n/2/F/Lmax' we first give a solvable case in the sense that the optimal schedule can be easily found. Then we again propose an approximation algorithm for general n/2/F/Lmax and derive its worst case bound.
منابع مشابه
Approximation of a generalized Euler-Lagrange type additive mapping on Lie $C^{ast}$-algebras
Using fixed point method, we prove some new stability results for Lie $(alpha,beta,gamma)$-derivations and Lie $C^{ast}$-algebra homomorphisms on Lie $C^{ast}$-algebras associated with the Euler-Lagrange type additive functional equation begin{align*} sum^{n}_{j=1}f{bigg(-r_{j}x_{j}+sum_{1leq i leq n, ineq j}r_{i}x_{i}bigg)}+2sum^{n}_{i=1}r_{i}f(x_{i})=nf{bigg(sum^{n}_{i=1}r_{i}x_{i}bigg)} end{...
متن کاملStart Project Y43-mat Combinatorial Approximation Algorithms Time Complexity and Linear-time Approximation of the Ancient Two Machine Flow Shop Time Complexity and Linear-time Approximation of the Ancient Two Machine Ow Shop
We consider the scheduling problems F 2 j j C max and F 2 j no-wait j C max , i.e. makespan minimization in a two machine ow shop, with and without no wait in process. For both problems solution algorithms based on sorting with O(n log n) running time are known, where n denotes the number of jobs Johnson 1954, Gilmore & Gomory 1964]. We prove that no asymptotically faster algorithms can solve t...
متن کاملOn optimality of exact and approximation algorithms for scheduling problems
We consider the classical scheduling problem on parallel identical machines to minimize the makespan. Under the exponential time hypothesis (ETH), lower bounds on the running times of exact and approximation algorithms are characterized. We achieve the following results: (1) For scheduling on a constant number m of identical machines, denoted by Pm||Cmax, a fully polynomial time approximation s...
متن کاملEfficient Algorithms for Just-In-Time Scheduling on a Batch Processing Machine
Just-in-time scheduling problem on a single batch processing machine is investigated in this research. Batch processing machines can process more than one job simultaneously and are widely used in semi-conductor industries. Due to the requirements of just-in-time strategy, minimization of total earliness and tardiness penalties is considered as the criterion. It is an acceptable criterion for b...
متن کاملFast reoptimization for the minimum spanning tree problem
Minimum spanning tree is a classical polynomial problem very well known in operational research and in theoretical computer science. In this paper, we settle the reoptimization versions of this problem, which can be formulated as follows: given an instance of the problem for which we already know some optimal solution, and given some “small” perturbations on this initial instance, is it possibl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009